Efficient Lazy Evaluation of Rule-Based Programs

Runtime verification of programs using rule-based active system

Evolution of rule-based programs

The term rule-based program is meant to include definite clause programs, SOS specifications, attribute grammars, and conditional rewrite systems. These setups are widely used for the executable specification or implementation of language-based tools, e.g., interpreters, translators, type checkers, program analysers, and program transformations. We provide a pragmatic, transformation-based appr...

Towards a Safe Partial Evaluation of Lazy Functional Logic Programs

Partial Evaluation is a well-known technique for specializing programs w.r.t. a given restriction of their input data. Although partial evaluation has been widely investigated in the context of functional and functional logic languages like Haskell or Curry, current schemes are either overly restrictive or destroy sharing through the specialization process, which may produce incorrect specializ...

Preserving Sharing in the Partial Evaluation of Lazy Functional Programs

The goal of partial evaluation is the specialization of programs w.r.t. part of their input data. Although this technique is already well-known in the context of functional languages, current approaches are either overly restrictive or destroy sharing through the specialization process, which is unacceptable from a performance point of view. In this work, we present a new partial evaluation sch...

An Efficient Load-Balancing Framework Based on Lazy Partitioning of Sequential Programs

This paper proposes an efficient load-balancing framework based on lazy partitioning of sequential programs where a single-threaded program is basically executed with little parallelization overhead but its computation is divisible for efficient utilization of multiple computing resources. Traditional fork-join multithreaded languages can be implemented on the top of our framework, but our fram...